An Iterative Procedure for General Probability Measures to Obtain I-projections onto Intersections of Convex Sets
نویسندگان
چکیده
The iterative proportional fitting procedure (IPFP) was introduced formally by Deming and Stephan in 1940. For bivariate densities, this procedure has been investigated by Kullback and Rüschendorf. It is well known that the IPFP is a sequence of successive I-projections onto sets of probability measures with fixed marginals. However, when finding the I-projection onto the intersection of arbitrary closed, convex sets (e.g., marginal stochastic orders), a sequence of successive I-projections onto these sets may not lead to the actual solution. Addressing this situation, we present a new iterative I-projection algorithm. Under reasonable assumptions and using tools from Fenchel duality, convergence of this algorithm to the true solution is shown. The cases of infinite dimensional IPFP and marginal stochastic orders are worked out in this context.
منابع مشابه
An Iterative Procedure for General Probability Measures to Obtain I-projections onto Intersections of Convex Sets by Bhaskar Bhattacharya
The iterative proportional fitting procedure (IPFP) was introduced formally by Deming and Stephan in 1940. For bivariate densities, this procedure has been investigated by Kullback and Rüschendorf. It is well known that the IPFP is a sequence of successive I-projections onto sets of probability measures with fixed marginals. However, when finding the I-projection onto the intersection of arbitr...
متن کاملSome Conditions for Characterizing Minimum Face in Non-Radial DEA Models with Undesirable Outputs
The problem of utilizing undesirable (bad) outputs in DEA models often need replacing the assumption of free disposability of outputs by weak disposability of outputs. The Kuosmanen technology is the only correct representation of the fully convex technology exhibiting weak disposability of bad and good outputs. Also, there are some specific features of non-radial data envelopment analysis (DEA...
متن کاملProjection Methods: An Annotated Bibliography of Books and Reviews
Projections onto sets are used in a wide variety of methods in optimization theory but not every method that uses projections really belongs to the class of projection methods as we mean it here. Here projection methods are iterative algorithms that use projections onto sets while relying on the general principle that when a family of (usually closed and convex) sets is present then projections...
متن کاملProjection Theorems for the R\'enyi Divergence on $\alpha$-Convex Sets
This paper studies forward and reverse projections for the Rényi divergence of order α ∈ (0,∞) on α-convex sets. The forward projection on such a set is motivated by some works of Tsallis et al. in statistical physics, and the reverse projection is motivated by robust statistics. In a recent work, van Erven and Harremoës proved a Pythagorean inequality for Rényi divergences on α-convex sets und...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کامل